MULTI-AGENT SYSTEMS MULTI-AGENT SYSTEMS MULTI-AGENT GAMES Rational and Convergent Learning in Stochastic Games
نویسندگان
چکیده
This paper investigates the problem of policy learn-ing in multiagent environments using the stochasticgame framework, which we briefly overview. Weintroduce two properties as desirable for a learningagent when in the presence of other learning agents,namely rationality and convergence. We examineexisting reinforcement learning algorithms accord-ing to these two properties and notice that they failto simultaneously meet both criteria. We then con-tribute a new learning algorithm, WoLF policy hill-climbing, that is based on a simple principle: “learnquickly while losing, slowly while winning.” Thealgorithm is proven to be rational and we presentempirical results for a number of stochastic gamesshowing the algorithm converges.
منابع مشابه
Utilizing Generalized Learning Automata for Finding Optimal Policies in MMDPs
Multi agent Markov decision processes (MMDPs), as the generalization of Markov decision processes to the multi agent case, have long been used for modeling multi agent system and are used as a suitable framework for Multi agent Reinforcement Learning. In this paper, a generalized learning automata based algorithm for finding optimal policies in MMDP is proposed. In the proposed algorithm, MMDP ...
متن کاملVoltage Coordination of FACTS Devices in Power Systems Using RL-Based Multi-Agent Systems
This paper describes how multi-agent system technology can be used as the underpinning platform for voltage control in power systems. In this study, some FACTS (flexible AC transmission systems) devices are properly designed to coordinate their decisions and actions in order to provide a coordinated secondary voltage control mechanism based on multi-agent theory. Each device here is modeled as ...
متن کاملReinforcement Learning in Cooperative Multi–Agent Systems
Reinforcement Learning is used in cooperative multi–agent systems differently for various problems. We provide a review on learning algorithms used for repeated common–payoff games, and stochastic general– sum games. Then these learning algorithms is compared with another algorithm for the credit assignment problem that attempts to correctly assign agents the awards that they deserve.
متن کاملMultiagent Reinforcement Learning in Stochastic Games
We adopt stochastic games as a general framework for dynamic noncooperative systems. This framework provides a way of describing the dynamic interactions of agents in terms of individuals' Markov decision processes. By studying this framework, we go beyond the common practice in the study of learning in games, which primarily focus on repeated games or extensive-form games. For stochastic games...
متن کاملOptimal adaptive leader-follower consensus of linear multi-agent systems: Known and unknown dynamics
In this paper, the optimal adaptive leader-follower consensus of linear continuous time multi-agent systems is considered. The error dynamics of each player depends on its neighbors’ information. Detailed analysis of online optimal leader-follower consensus under known and unknown dynamics is presented. The introduced reinforcement learning-based algorithms learn online the approximate solution...
متن کامل